Answering Planning Queries with the Crowd

نویسندگان

  • Haim Kaplan
  • Ilia Lotosh
  • Tova Milo
  • Slava Novgorodov
چکیده

Recent research has shown that crowd sourcing can be used effectively to solve problems that are difficult for computers, e.g., optical character recognition and identification of the structural configuration of natural proteins. In this paper we propose to use the power of the crowd to address yet another difficult problem that frequently occurs in a daily life answering planning queries whose output is a sequence of objects/actions, when the goal, i.e, the notion of “best output”, is hard to formalize. For example, planning the sequence of places/attractions to visit in the course of a vacation, where the goal is to enjoy the resulting vacation the most, or planning the sequence of courses to take in an academic schedule planning, where the goal is to obtain solid knowledge of a given subject domain. Such goals may be easily understandable by humans, but hard or even impossible to formalize for a computer. We present a novel algorithm for efficiently harnessing the crowd to assist in answering such planning queries. The algorithm builds the desired plans incrementally, choosing at each step the ‘best’ questions so that the overall number of questions that need to be asked is minimized. We prove the algorithm to be optimal within its class and demonstrate experimentally its effectiveness and efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی

Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...

متن کامل

Database Techniques in Crowd Simulations and the Scheduling Problem in Sdf Graphs

Crowd simulations are a popular and difficult research topic in the development of computer games. There has been a lot of work in the graphics community on realistically animating a large number of characters in close proximity. Unfortunately, these simulations are not particularly interactive. Crowds must be specified ahead of time, and cannot form as a result of emergent behavior; characters...

متن کامل

NoXperanto: Crowdsourced Polyglot Persistence

This paper proposes NOXPERANTO, a novel crowdsourcing approach to address querying over data collections managed by polyglot persistence settings. The main contribution of NOXPERANTO is the ability to solve complex queries involving different data stores by exploiting queries from expert users (i.e. a crowd of database administrators, data engineers, domain experts, etc.), assuming that these u...

متن کامل

The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation

We describe and demonstrate the Explicit Corridor Map (ECM), a navigation mesh for path planning and crowd simulation in virtual environments. For a bounded 2D environment with polygonal obstacles, the ECM is the medial axis of the free space annotated with nearest-obstacle information. It can be used to compute short and smooth paths for disk-shaped characters of any radius. It is also well-de...

متن کامل

Chorus: Letting the Crowd Speak with One Voice

Autonomous systems cannot yet reliably engage in an openended dialogue with users due the complexity of natural language processing, but online crowds present new opportunities to do so. We introduce Chorus, a system enabling real-time two-way natural language conversation between an end user and a single virtual agent powered by a distributed crowd of online humans. Chorus maintains consistent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • PVLDB

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2013